Implementation of a SPIHT coprocessor: memory issues and hardware implications

نویسندگان

  • Maurizio Martina
  • Andrea Molino
  • Andrea Terreno
  • Fabrizio Vacca
چکیده

In the last years mobile terminals diffusion has fostered the development of new audio–visual services. Thus the possibility to employ wireless devices to exchange multimedia informations is becoming real. Beyond these attractive motivations, some critical factors are hidden: the design of wireless terminals, in fact, has to deal with limited power budgets and reduced resources availability. This paper proposes an hardware implementation of a SPIHT coprocessor, designed for mobile environments. Particular emphasis will be posed on memory requirements and their hardware implications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VLSI Implementation of a Modified Efficient SPIHT Encoder

Set Partitioning in Hierarchical Trees (SPIHT) is a highly efficient technique for compressing Discrete Wavelet Transform (DWT) decomposed images. Though its compression efficiency is a little less famous than Embedded Block Coding with Optimized Truncation (EBCOT) adopted by JPEG2000, SPIHT has a straight forward coding procedure and requires no tables. These make SPIHT a more appropriate algo...

متن کامل

Low Memory Color Image Zerotree Coding

Said and Pearlman’s Set Partitioning In Hierarchical Trees (SPIHT) algorithm [5] is a well-known and efficient zerotree coding algorithm. However SPIHT’s high memory requirement is a major drawback for hardware implementation. In this paper we present a color image coding algorithm which requires much less memory during coding. Consequently the implementation complexity and hardware cost can be...

متن کامل

A Memory Efficient and Faster Modification of Set Partitioning In Hierarchical Trees (SPIHT) Algorithm

The introduction of the zero-tree wavelet image coding technique has leaded to the development of many new and powerful coding algorithms based on its theory. Because of simplicity and coding efficiency, Said and Pearlman’s Set Partitioning In Hierarchical Trees (SPIHT) algorithm is treated as one of the most significant among these algorithms. However the high memory requirement and time-consu...

متن کامل

SPIHT implemented in a XC4000 device

In this paper we present an efficient FPGA implementation of the ’Set Partitioning in Hierarchical Trees’ (SPIHT) algorithm of Said and Pearlman [1] in combination with an arithmetic coder. The FPGA implementation is applied within a partitioned approach for wavelet-based lossy image compression [2]. The basic SPIHT algorithm uses dynamic data structures that make a hardware realization difficu...

متن کامل

Efficient Architecture for SPIHT Algorithm in Image Compression

A arithmetic coder architecture with a high throughput memory efficient for set partitioning in hierarchical trees is proposed in this paper. This paper also presents a throughput efficient image compression using ‘Set Partitioning in Hierarchical Trees’ (SPIHT) algorithm for compression of images. The SPIHT use inherent redundancy among wavelet coefficients and suited for both gray and color i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003